Genetic algorithm-based optimization of hydrophobicity tables

نویسندگان

  • Moti Zviling
  • Hadas Leonov
  • Isaiah T. Arkin
چکیده

SUMMARY The genomic abundance and pharmacological importance of membrane proteins have fueled efforts to identify them based solely on sequence information. Previous methods based on the physicochemical principle of a sliding window of hydrophobicity (hydropathy analysis) have been replaced by approaches based on hidden Markov models or neural networks which prevail due to their probabilistic orientation. In the current study, an optimization of the hydrophobicity tables used in hydropathy analysis is performed using a genetic algorithm. As such, the approach can be viewed as a synthesis between the physicochemically and statistically based methods. The resulting hydrophobicity tables lead to significant improvement in the prediction accuracy of hydropathy analysis. Furthermore, since hydropathy analysis is less dependent on the basis set of membrane proteins is used to hone the statistically based methods, as well as being faster, it may be valuable in the analysis of new genomes. Finally, the values obtained for each of the amino acids in the new hydrophobicity tables are discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

متن کامل

Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

متن کامل

Design Optimization of Axial Flux Surface Mounted Permanent Magnet Brushless DC Motor For Electrical Vehicle Based on Genetic Algorithm

This paper presents the design optimization of axial flux surface mounted Permanent Magnet Brushless DC motor based on genetic algorithm for an electrical vehicle application. The rating of the motor calculated form vehicle dynamics is 250 W, 150 rpm. The axial flux surface mounted Permanent Magnet Brushless DC (PMBLDC) motor was designed to fit in the rim of the wheel. There are several design...

متن کامل

STRUCTURAL OPTIMIZATION USING A MUTATION-BASED GENETIC ALGORITHM

The present study is an attempt to propose a mutation-based real-coded genetic algorithm (MBRCGA) for sizing and layout optimization of planar and spatial truss structures. The Gaussian mutation operator is used to create the reproduction operators. An adaptive tournament selection mechanism in combination with adaptive Gaussian mutation operators are proposed to achieve an effective search in ...

متن کامل

Genetic Algorithm-based Optimization Procedures to Find the Constants of Johnson-Cook Constitutive Equation

Johnson-Cook constitutive equation is one of the most famous constitutive equations that have ever been developed to model the hot deformation flow curves of different materials. This equation is a predefined model in the traditional finite element codes to describe the material behavior in applications such as simulating the manufacturing processes. In this work, two different genetic algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Bioinformatics

دوره 21 11  شماره 

صفحات  -

تاریخ انتشار 2005